Δ1-completions of a Poset

نویسندگان

  • Mai Gehrke
  • Ramon Jansana
  • Alessandra Palmigiano
چکیده

A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems on the lattice of up-sets of the poset. A ∆1-completion of a poset is a completion for which, simultaneously, each element is obtainable as a join of meets of elements of the original poset and as a meet of joins of elements from the original poset. We show that ∆1-completions are in one-to-one correspondence with certain triples consisting of a closure system of down-sets of the poset, a closure system of up-sets of the poset, and a binary relation between these two systems. Certain ∆1-completions, which we call compact, may be described just by a collection of filters and a collection of ideals, taken as parameters. The compact ∆1-completions of a poset include its MacNeille completion and all its joinand all its meetcompletions. These completions also include the canonical extension of the given poset, a completion that encodes the topological dual of the poset when it has one. Finally, we use our parametric description of ∆1-completions to compare the canonical extension to other compact ∆1-completions identifying its relative merits.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

∆ 1 - Completions of a Poset Mai Gehrke & Ramon Jansana

A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems on the lattice of up-sets of the poset. A ∆1-completion of a poset is a completion for which, simultaneously, each element is obtainable as a ...

متن کامل

Finite Orders and Their Minimal Strict Completion Lattices

Whereas the Dedekind-MacNeille completion D(P ) of a poset P is the minimal lattice L such that every element of L is a join of elements of P, the minimal strict completion D(P )∗ is the minimal lattice L such that the poset of join-irreducible elements of L is isomorphic to P. (These two completions are the same if every element of P is joinirreducible). In this paper we study lattices which a...

متن کامل

Derived Semidistributive Lattices

Let C(L) denote the set of covers of a poset L: γ ∈ C(L) if and only γ = (γ0, γ1) ∈ L×L and the interval {x | γ0 ≤ x ≤ γ1 } is a two elements poset. If L is a lattice then there is a natural ordering of C(L): γ ≤ δ if and only if γ0 ≤ δ0, γ1 6≤ δ0, and γ1 ≤ δ1. That is, γ ≤ δ if and only if the cover γ transposes up to δ. For α ∈ C(L) let C(L,α) denote the component of the poset C(L) connected ...

متن کامل

Posets of Finite Functions

The symmetric group S(n) is partially ordered by Bruhat order. This order is extended by L. Renner to the set of partial injective functions of {1, 2, . . . , n} (see, Linear Algebraic Monoids, Springer, 2005). This poset is investigated by M. Fortin in his paper The MacNeille Completion of the Poset of Partial Injective Functions [Electron. J. Combin., 15, R62, 2008]. In this paper we show tha...

متن کامل

Meet-completions and ordered domain algebras

Using the well-known equivalence between meet-completions of posets and standard closure operators we show a general method for constructing meet-completions for isotone poset expansions. With this method we find a meet-completion for ordered domain algebras which simultaneously serves as the base of a representation for such algebras, thereby proving that ordered domain algebras have the finit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Order

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2013